Developing a TT-MCTAG for German with an RCG-based Parser

نویسندگان

  • Laura Kallmeyer
  • Timm Lichte
  • Wolfgang Maier
  • Yannick Parmentier
  • Johannes Dellert
چکیده

Developing linguistic resources, in particular grammars, is known to be a complex task in itself, because of (amongst others) redundancy and consistency issues. Furthermore some languages can reveal themselves hard to describe because of specific characteristics, e.g. the free word order in German. In this context, we present (i) a framework allowing to describe tree-based grammars, and (ii) an actual fragment of a core multicomponent tree-adjoining grammar with tree tuples (TT-MCTAG) for German developed using this framework. This framework combines a metagrammar compiler and a parser based on range concatenation grammar (RCG) to respectively check the consistency and the correction of the grammar. The German grammar being developed within this framework already deals with a wide range of scrambling and extraction phenomena.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TuLiPA - Parsing Extensions of TAG with Range Concatenation Grammars

In this paper we present a parsing framework for extensions of Tree Adjoining Grammars (TAG) called TuLiPA (Tübingen Linguistic Parsing Architecture). In particular, besides TAG, the parser can process Tree-Tuple MCTAG with shared nodes (TT-MCTAG), a TAG-extension that has been proposed to deal with scrambling in free word order languages such as German. The central strategy of the parser is su...

متن کامل

On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG)

This paper investigates the relation between TT-MCTAG, a formalism used in computational linguistics, and RCG. RCGs are known to describe exactly the class PTIME; simple RCG even have been shown to be equivalent to linear context-free rewriting systems, i.e., to be mildly context-sensitive. TT-MCTAG has been proposed to model free word order languages. In general, it is NP-complete. In this pap...

متن کامل

Converting tree tuple multicomponent tree adjoining grammars (TT-MCTAGs) into range concatenation grammars (RCGs)

RÉSUMÉ. Cet article étudie la relation entre le formalisme TT-MCTAG et le formalisme RCG. RCG est connu pour décrire exactement la classe PTIME. TT-MCTAG a été proposé pour modéliser les langues à ordre des mots libre. Nous montrons comment une forme restreinte de TT-MCTAG peut être convertie en une RCG « simple » équivalente. Le résultat est intéressant pour des raisons théoriques (il montre q...

متن کامل

TuLiPA: A syntax-semantics parsing environment for mildly context-sensitive formalisms

In this paper we present a parsing architecture that allows processing of different mildly context-sensitive formalisms, in particular Tree-Adjoining Grammar (TAG), Multi-Component Tree-Adjoining Grammar with Tree Tuples (TT-MCTAG) and simple Range Concatenation Grammar (RCG). Furthermore, for tree-based grammars, the parser computes not only syntactic analyses but also the corresponding semant...

متن کامل

From Partial VP Fronting towards Spinal TT-MCTAG

In the face of partial fronting phenomena in German, we introduce spinal TT-MCTAG, a new MCTAG variant that integrates features of LTAG-spinal and TT-MCTAG. Using spinal TT-MCTAG we arrive at flat syntactic structures which make available a consistent account for the data.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008